forgetful homomorphism

См. также в других словарях:

• Forgetful functor — In mathematics, in the area of category theory, a forgetful functor is a type of functor. The nomenclature is suggestive of such a functor s behaviour: given some object with structure as input, some or all of the object s structure or properties …   Wikipedia

• Adjoint functors — Adjunction redirects here. For the construction in field theory, see Adjunction (field theory). For the construction in topology, see Adjunction space. In mathematics, adjoint functors are pairs of functors which stand in a particular… …   Wikipedia

• Category of rings — In mathematics, the category of rings, denoted by Ring, is the category whose objects are rings (with identity) and whose morphisms are ring homomorphisms (preserving the identity). Like many categories in mathematics, the category of rings is… …   Wikipedia

• Functor — For functors as a synonym of function objects in computer programming to pass function pointers along with its state, see function object. For the use of the functor morphism presented here in functional programming see also the fmap function of… …   Wikipedia

• Semilattice — In mathematics, a join semilattice (or upper semilattice) is a partially ordered set which has a join (a least upper bound) for any nonempty finite subset. Dually, a meet semilattice (or lower semilattice) is a partially ordered set which has a… …   Wikipedia

• Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… …   Wikipedia

• Category of abelian groups — In mathematics, the category Ab has the abelian groups as objects and group homomorphisms as morphisms. This is the prototype of an abelian category.The monomorphisms in Ab are the injective group homomorphisms, the epimorphisms are the… …   Wikipedia

• Complete Boolean algebra — This article is about a type of mathematical structure. For complete sets of Boolean operators, see Functional completeness. In mathematics, a complete Boolean algebra is a Boolean algebra in which every subset has a supremum (least upper bound) …   Wikipedia

• Tensor algebra — In mathematics, the tensor algebra of a vector space V , denoted T ( V ) or T bull;( V ), is the algebra of tensors on V (of any rank) with multiplication being the tensor product. It is the free algebra on V , in the sense of being left adjoint… …   Wikipedia

• Fibred category — Fibred categories are abstract entities in mathematics used to provide a general framework for descent theory. They formalise the various situations in geometry and algebra in which inverse images (or pull backs) of objects such as vector bundles …   Wikipedia

• Free object — In mathematics, the idea of a free object is one of the basic concepts of abstract algebra. It is a part of universal algebra, in the sense that it relates to all types of algebraic structure (with finitary operations). It also has a clean… …   Wikipedia